A new class of fast shape-adaptive orthogonal transforms and their application to region-based image compression

نویسندگان

  • Ryszard Stasinski
  • Janusz Konrad
چکیده

for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract|Region-based approaches to image and video compression have been very actively explored in the last few years. It is widely expected that they will result in rate/quality gains and expanded functionalities. In such approaches one of the essential problems is the representation of luminance and color in arbitrarily-shaped regions. For rectangular blocks extracted from natural images the discrete cosine transform (DCT) has been found to perform close to the eigentransform. Although for arbitrarily-shaped regions orthogonalization-based procedures have been shown to perform very well, their computational complexity and memory requirements are prohibitive for today's technology. Therefore, other approaches are presently investigated and particular attention is paid to low implementation complexity. In this paper, we propose a new class of orthogonal transforms that self-adapt to arbitrary shapes. The new algorithms are derived from owgraphs of standard fast transform algorithms by a suitable modiication of certain butterry operators. First, we show how to derive a shape-adaptive transform from the discrete Walsh-Hadamard transform (DWHT) owgraph. Then, we discuss modiications needed to arrive at a DCT-based shape-adaptive transform. We give implementation details of this transform and compare its computational complexity with several well-known approaches. We also evaluate the energy compaction performance of the new transform for both synthetic and natural data. We conclude that the proposed DCT-based shape-adaptive transform gives a very benee-cial compaction/complexity ratio compared to other well-known approaches. The complexity of the new method does not exceed the complexity of two non-adaptive DCTs on a circumscribing rectangle, and therefore, unlike other tested methods with comparable energy compaction, it is suitable for large regions. This property should prove very valuable in the future when true region-based image/video compression methods are developed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Block-Based Compressive Sensing Using Soft Thresholding of Adaptive Transform Coefficients

Compressive sampling (CS) is a new technique for simultaneous sampling and compression of signals in which the sampling rate can be very small under certain conditions. Due to the limited number of samples, image reconstruction based on CS samples is a challenging task. Most of the existing CS image reconstruction methods have a high computational complexity as they are applied on the entire im...

متن کامل

فشرده‌سازی تصویر با کمک حذف و کدگذاری هوشمندانه اطلاعات تصویر و بازسازی آن با استفاده از الگوریتم های ترمیم تصویر

Compression can be done by lossy or lossless methods. The lossy methods have been used more widely than the lossless compression. Although, many methods for image compression have been proposed yet, the methods using intelligent skipping proper to the visual models has not been considered in the literature. Image inpainting refers to the application of sophisticated algorithms to replace lost o...

متن کامل

On a Class of Parametric Transforms and Its Application to Image Compression

A class of parametric transforms that are based on unified representation of transform matrices in the form of sparse matrix products is described. Different families of transforms are defined within the introduced class. All transforms of one family can be computed with fast algorithms similar in structure to each other. In particular, the family of Haar-like transforms consists of discrete or...

متن کامل

Image Coding Using Vector-Embedded Karhunen-Loeve Transform

In this paper, the theory and the design of a new class of orthogonal transforms are presented. The novel transform is derived from a correlation matrix in which an arbitrary orthonormal system is embedded. By embedding an orthonormal system designed empirically, we obtain the transform that can not only represent intuitive features but also possess statistical property like the KLT. Our main m...

متن کامل

Vector-Embedded Karhunen-Loève Transform and Its Application in Orientation Adaptive Coding of Images∗

In this paper, the theory and the design of a new class of orthogonal transforms are presented. The novel transform is derived from a correlation matrix in which an arbitrary orthonormal system is embedded. By embedding an orthonormal system designed empirically, we obtain the transform that is not only adapted for perceptual information but also possess statistical property like the Karhunen-L...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Circuits Syst. Video Techn.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1999